A Variable Neighbourhood Search for Component Pick-and- Place Sequencing in Printed Circuit Board Assembly

نویسنده

  • Masri Ayob
چکیده

This work presents a heuristic for component pick-and-place sequencing to improve the throughput of a multi-head surface mount device placement machine for assembling printed circuit board. We present a Variable Neighbourhood Monte Carlo Search (VNMS), which employs variable neighbourhood search with an Exponential Monte Carlo acceptance criterion. VNMS is a descent-ascent heuristic that operates on three sets of neighbourhood structures that are based on three different local searchers. The first two sets use a steepest descent and Exponential Monte Carlo local search, respectively whilst the third set uses a random 3-opt operator. The solution returned by a local search, after exploring a neighbourhood structure, will be accepted based on the EMCQ (Exponential Monte Carlo with counter) acceptance criterion. The novelty of the VNMS approach (in the context of VNS) is the concept of three stages of neighbourhood search, using an EMCQ acceptance criterion (at the VNS level) and the shaking procedure (which is only applied when the local searchers cannot find an improved solution). Results show that the VNMS consistently produces good quality solutions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Variable Neighbourhood Monte Carlo Search for Component Placement Sequencing of Multi-Head Placement Machine

This work considers the optimisation of component placement sequencing to improve the efficiency of theoretical multi-head surface mount device placement machines in printed circuit board assembly. We develop a Variable Neighbourhood Monte Carlo Search (VNMS), which employs a variable neighbourhood search technique with an Exponential Monte Carlo acceptance criterion. VNMS is a descent-ascent h...

متن کامل

Effective Heuristic and Metaheuristic Approaches to Optimize Component Placement in Printed Circuit Board Assembly

This paper considers a scheduling problem arising for numerically controlled machines in the manufacture of printed circuit boards. In order to maximize the throughput rate of these machines the time taken for the pick and place sequence of components for each board has to be minimized. The determination of good pick and place sequences on a single placement machine gives rise to three related ...

متن کامل

New Models and Heuristics for Component Placement in Printed Circuit Board Assembly

This paper considers an optimization problem arising in the automated manufacture of printed circuit boards. An essential part of this problem is to determine good component pick and place sequences as this can reduce the overall assembly time significantly. This component placement sequence problem can be modelled as a Travelling Salesman Problem, however complex machine and process specificat...

متن کامل

Optimal Machine Setup and Product Clustering for Printed Circuit Board Manufacturing

In the manufacture of printed circuit boards, electronic components are attached to a blank board by one or more pick-and-place machines. Each machine has component magazines that house replaceable feeders. Since component requirements differ among board types, each change of feeders can improve processing time but indicates a machine setup. We develop an integer programming model for the joint...

متن کامل

Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem

In this paper we present effective new local and variable neighbourhood search heuristics for the asymmetric Travelling Salesman Problem. Our local search approach, HyperOpt, is inspired by a heuristic developed for a sequencing problem arising in the manufacture of printed circuit boards. In our approach we embed an exact algorithm into a local search heuristic in order to exhaustively search ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007